Special Issue in Honor of Geoff Whittle

نویسندگان

DILLON MAYHEW

JAMES OXLEY

CHARLES SEMPLE

Geoff Whittle

Dillon Mayhew

Charles Semple

Jim Geelen

Bert Gerards

James Oxley

Dirk Vertigan

چکیده

Geoff Whittle turned 60 in 2010. To mark this occasion, this special issue (guestedited by Dillon Mayhew and Charles Semple) aims to recognize and celebrate his mathematical contributions. Perhaps surprisingly, we can confidently say that Geoff’s best work lies ahead of him, for some of the most significant results from his longstanding collaboration with Jim Geelen and Bert Gerards have been announced, but not yet published. This collaboration has produced matroid analogues of the well-quasi-ordering results from Robertson and Seymour’s monumental Graph Minors Project. In addition, it is anticipated that Rota’s conjecture, a problem long considered to be one of the most difficult in discrete mathematics, will also be settled by Jim, Bert, and Geoff. It is already clear that their work deserves to be ranked alongside that of W. T. Tutte and Paul Seymour as the most significant ever done in matroid theory. In this preface, we will introduce matroids after giving some biographical details of Geoff’s life. Our main task is to give a brief description of Geoff’s contributions to the development of matroid theory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Basis-exchange Properties of Sparse Paving Matroids

It has been conjectured that, asymptotically, almost all matroids are sparse paving matroids. We provide evidence for five long-standing, basis-exchange conjectures by proving them for this large class of matroids. To Geoff Whittle on his 60th birthday

متن کامل

On Representable Matroids Having Neither U2,5– Nor U3,5–minors

Consider 3–connected matroids that are neither binary nor ternary and have neither U2,5– nor U3,5–minors: for example, AG(3, 2)′, the matroid obtained by relaxing a circuit-hyperplane of AG(3, 2). The main result of the paper shows that no matroid of this sort is representable over any field. This result makes it possible to extend known characterisations of the binary and ternary matroids repr...

متن کامل

Determining a Binary Matroid from its Small Circuits

It is well known that a rank-r matroid M is uniquely determined by its circuits of size at most r. This paper proves that if M is binary and r > 3, then M is uniquely determined by its circuits of size at most r − 1 unless M is a binary spike or a special restriction thereof. In the exceptional cases, M is determined up to

متن کامل